Polychromatic cliques
نویسندگان
چکیده
منابع مشابه
Polychromatic Hamilton cycles
The edges of the complete graph Kn are coloured so that no colour appears no more than k times, k = [n/Alnn], for some sufficiently large A. We show that there is always a Hamiltonian cycle in which each edge is a different colour. The proof technique is probabilistic. 'Supported by NSF grant CCR-89000112
متن کاملChromosomal cliques
re chromosomes distributed randomly within the cell nucleus during interphase, or do they preferentially cluster into specific groups? On page 237, Cornforth et al. address this question, which has been debated vigorously for nearly a century, and conclude that the distribution of chromosomes within the nucleus of human cells is mostly, but not entirely, random. The work provides the most compr...
متن کاملCover-Decomposition and Polychromatic Numbers
A colouring of a hypergraph’s vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number, is the maximum number of disjoint hyperedgecovers. In geometric hypergraphs, there is extensive work on lower-bounding these numbers in terms of their trivi...
متن کاملObservation of polychromatic vortex solitons.
We demonstrate experimentally the formation of polychromatic single- and double-charge optical vortex solitons by employing a lithium niobate crystal as a nonlinear medium with defocusing nonlinearity. We study the wavelength dependence of the vortex core localization and observe self-trapping of polychromatic vortices with a bandwidth spanning over more than 70 nm for single-charge and 180 nm ...
متن کاملPolychromatic Colorings on the Hypercube
Given a subgraph G of the hypercube Qn, a coloring of the edges of Qn such that every embedding of G contains an edge of every color is called a G-polychromatic coloring. The maximum number of colors with which it is possible to G-polychromatically color the edges of any hypercube is called the polychromatic number of G. To determine polychromatic numbers, it is only necessary to consider a str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.02.013